Voting Theory in the Lean Theorem Prover

The Lean Theorem Prover (System Description)

Lean is a new open source theorem prover being developed at Microsoft Research and Carnegie Mellon University, with a small trusted kernel based on dependent type theory. It aims to bridge the gap between interactive and automated theorem proving, by situating automated tools and methods in a framework that supports user interaction and the construction of fully specified axiomatic proofs. Lean...

Formalizing Mathematics using the Lean Theorem Prover

A Theorem Prover for Elementary Set Theory

This is a repor t of some of our research ca r r i e d out mainly dur ing the summer and f a l l of 1974, i t describes an implementation of a theorem prover based on t r u t h value preserv ing t ransformat ions which has been appl ied to prov ing theorems in the domain of elementary set theory . In sec t ion 2 we descr ibe the basic deduct ive system, and in sect ion 3 we present some p ro to...

The Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover

HTP is an SMT Modulo theorem prover similar to many others.[2–6, 9, 11] As input, HTP accepts problems using the SMT-LIB format[8]. As output, HTP will answer either SAT, UNSAT or UNKNOWN. Alternatively, HTP can be run in a preprocessing mode in which the output is the simplified problem in SMTLIB format. An evidence file showing the derivation in a human readable form can be produced. There is...

The ASMKeY Theorem Prover

In [8], we presented a logic for Abstract State Machines (ASMs). In this technical report, we present an interactive theorem prover call ASMKeY where we implemented this logic. We also present a small case study to show the effectivness of our approach.